Generation of Hierarchical Dictionary for Stroke-order Free Kanji Handwriting Recognition Based on Substroke HMM

نویسندگان

  • Mitsuru Nakai
  • Hiroshi Shimodaira
  • Shigeki Sagayama
چکیده

This paper describes a method of generating a Kanji hierarchical structured dictionary for stroke-number and stroke-order free handwriting recognition based on substroke HMM. In stroke-based methods, a large number of stroke-order variations can be easily expressed by just adding different stroke sequences to the dictionary and it is not necessary to train new reference patterns. The hierarchical structured dictionary has an advantage that thousands of stroke-order variations of Kanji characters can be produced using a small number of stroke-order rules defining Kanji parts. Moreover, the recognition speed is fast since common sequences are shared in a substroke network, even if the total number of stroke-order combinations becomes enormous practically. In experiments, 300 different stroke-order rules of Kanji parts were statistically chosen by using 60 writers’ handwritings of 1,016 educational Kanji characters. By adding these new stroke-order rules to the dictionary, about 9,000 variations of different stroke-orders were generated for 2,965 JIS 1st level Kanji characters. As a result, we successfully improved the recognition accuracy from 82.6% to 90.2% for stroke-order free handwritings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Substroke Approach to HMM-Based On-line Kanji Handwriting Recognition

A new method is proposed for on-line handwriting recognition of Kanji characters. The method employs substroke HMMs as minimum units to constitute Japanese Kanji characters and utilizes the direction of pen motion. The main motivation is to fully utilize the continuous speech recognition algorithm by relating sentence speech to Kanji character , phonemes to substrokes, and grammar to Kanji stru...

متن کامل

Context-dependent substroke model for HMM-based on-line handwriting recognition

This paper describes context-dependent substroke hidden Markov models (HMMs) for on-line handwritten recognition of cursive Kanji and Hiragana characters. As there are more than 6,000 distinctive characters including Kanji and Hiragana in Japanese, modeling each character by an HMM leads to an infeasible character-recognition system requiring huge amount of memory and enormous computation time....

متن کامل

On-line Overlaid-Handwriting Recognition Based on Substroke HMMs

This paper proposes a novel handwriting recognition interface for wearable computing where users write characters continuously without pauses on a small single writing box. Since characters are written on the same writing area, they are overlaid with each other. Therefore the task is regarded as a special case of the continuous character recognition problem. In contrast to the conventional cont...

متن کامل

Recent Results of Online Japanese Handwriting Recognition and Its Applications

This paper discusses online handwriting recognition of Japanese characters, a mixture of ideographic characters (Kanji) of Chinese origin, and the phonetic characters made from them. Most Kanji character patterns are composed of multiple subpatterns, called radicals, which are shared among many (sometimes hundreds of) Kanji character patterns. This is common in Oriental languages of Chinese ori...

متن کامل

On-Line Handwriting Recognition Using Hidden Markov Models

New global information-bearing features improved the modeling of individual letters, thus diminishing the error rate of an HMM-based on-line cursive handwriting recognition system. This system also demonstrated the ability to recognize on-line cursive handwriting in real time. The BYBLOS continuous speech recognition system, a hidden Markov model (HMM) based recognition system, is applied to on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003